Parallel Reduction of Matrices in Gröbner Bases Computations
نویسنده
چکیده
Unfortunately the computation is time-and memory intensive. Mathematical knowledge is used to optimize the algorithms. Computer science provides another possibility to increase the computations: parallelization 2 / 24 Motivation Gröbner bases are used, to solve polynomial equation systems, move robotics, verify programs,. .. Unfortunately the computation is time-and memory intensive. Mathematical knowledge is used to optimize the algorithms. Computer science provides another possibility to increase the computations: parallelization 2 / 24 Motivation Gröbner bases are used, to solve polynomial equation systems, move robotics, verify programs,. .. Unfortunately the computation is time-and memory intensive. Mathematical knowledge is used to optimize the algorithms. Computer science provides another possibility to increase the computations: parallelization 2 / 24
منابع مشابه
A modified parallel F4 algorithm for shared and distributed memory architectures
In applications of symbolic computation an often required but complex procedure is finding Gröbner bases for polynomial ideals. Hence it is obvious to realize parallel algorithms to compute them. There are already flavours of the F4 algorithm like [4] and [13] using the special structure of the occurring matrices to speed up the reductions on parallel architectures with shared memory. In this p...
متن کاملNormal Forms for Operators via Gröbner Bases in Tensor Algebras
We propose a general algorithmic approach to noncommutative operator algebras generated by linear operators using quotients of tensor algebras. In order to work with reduction systems in tensor algebras, Bergman’s setting provides a tensor analog of Gröbner bases. We discuss a modification of Bergman’s setting that allows for smaller reduction systems and tends to make computations more efficie...
متن کاملRegular Gröbner Bases
In Ufnarovski (1989), the concept of automaton algebras is introduced. These are quotients of the non-commutative polynomial ring where the defining ideal allows some Gröbner basis with a regular set of leading words. However, nothing is reflected concerning the whole structure of the Gröbner basis (except of course for monomial algebras). In this paper we introduce the concept of regular Gröbn...
متن کاملPractical computations with Gröbner bases
Since their invention by Buchberger in 1965, Gröbner bases have become a pervasive tool in computational mathematics. In this paper we show several sorts of Gröbner basis computations in Mathematica. We discuss computations of approximate Gröbner bases, with applications to solving systems and implicitization. We also show how to use the built-in GroebnerBasis function to compute polynomial gre...
متن کاملLinear Algebraic Approach to H-basis Computation
Macaulay introduced the notion of H-bases [2]. His original motivation was the transformation of systems of polynomial equations into simpler ones. The power of this concept was not really understood presumably because of the lack of facilities for symbolic computations. Later Buchberger invented Gröbner bases for computing multiplication tables for factor rings [1]. When Computer Algebra Syste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012